Bounds on circular consecutive choosability
نویسندگان
چکیده
The circular consecutive choosability chcc(G) of a graph G has been recently introduced in [2]. In this paper we prove upper bounds on chcc for series-parallel graphs, planar graphs and k-choosable graphs. Our bounds are tight for classes of series-parallel graphs and k-choosable graphs for k ≥ 3. Then we study the circular consecutive choosability of generalized theta graphs. Lower bounds for the circular consecutive choosability of certain generalized theta graphs are obtained.
منابع مشابه
Circular consecutive choosability of graphs
Abstract This paper considers list circular colouring of graphs in which the colour list assigned to each vertex is an interval of a circle. The circular consecutive choosability chcc(G) of G is defined to be the least t such that for any circle S(r) of length r ≥ χc(G), if each vertex x of G is assigned an interval L(x) of S(r) of length t, then there is a circular r-colouring f of G such that...
متن کاملCircular consecutive choosability of k-choosable graphs
Let S(r) denote a circle of circumference r. The circular consecutive choosability chcc(G) of a graph G is the least real number t such that for any r > χc(G), if each vertex v is assigned a closed interval L(v) of length t on S(r), then there is a circular r-colouring f of G such that f(v) ∈ L(v). We investigate, for a graph, the relations between its circular consecutive choosability and choo...
متن کاملOn two questions about circular choosability
We answer two questions of Zhu on circular choosability of graphs. We show that the circular list chromatic number of an even cycle is equal to 2 and give an example of a graph for which the infimum in the definition of the circular list chromatic number is not attained.
متن کاملCircular choosability is rational
The circular choosability or circular list chromatic number of a graph is a list-version of the circular chromatic number, introduced by Mohar [4] and studied in [17, 2, 5, 7, 8, 15] and [10]. One of the nice properties that the circular chromatic number enjoys is that it is a rational number for all finite graphs G (see for instance [16]), and a fundamental question, posed by Zhu [17] and reit...
متن کاملAdapted List Coloring of Graphs and Hypergraphs
We introduce and study adapted list coloring of graphs and hypergraphs. This is a generalization of ordinary list coloring and adapted coloring, and has more applications than these. We prove that the upper bounds on the adaptable choosability of graphs and uniform hypergraphs in terms of maximum degree are sufficiently stronger than those on the ordinary choosability, while the bounds in terms...
متن کامل